Calculating Valid Domains for BDD-Based Interactive Configuration

نویسندگان

  • Tarik Hadzic
  • Rune M. Jensen
  • Henrik Reif Andersen
چکیده

In these notes we formally describe the functionality of Calculating Valid Domains from the BDD representing the solution space of valid configurations. The formalization is largely based on the CLab [1] configuration framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Configuration by Regular String Constraints

A product configurator which is complete, backtrack free and able to compute the valid domains at any state of the configuration can be constructed by building a Binary Decision Diagram (BDD). Despite the fact that the size of the BDD is exponential in the number of variables in the worst case, BDDs have proved to work very well in practice. Current BDD-based techniques can only handle interact...

متن کامل

CLab: A C++ Library for Fast Backtrack-Free Interactive Product Configuration

Product configuration is a successful application area of constraint programming. CLab [1, 2] is an open source C++ library for building fast backtrack-free interactive product configurators. It contains functions that support a two-phase approach to interactive product configuration described by Hadzic et al. [3]. In the first phase, a Binary Decision Diagram (BDD) representing the set of vali...

متن کامل

A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration

Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be conveniently formulated as a Constraint Satisfaction Problem where the constraints are propositional formulas. The problem of interactive configuration was originally inspired by the product configuration problem with the emerg...

متن کامل

Fast Backtrack-free Product Configuration Using a Precompiled Solution Space Representation

In this paper we describe a two-phase approach to interactive product configuration. In the first phase, a compressed symbolic representation of the set of valid configurations (the solution space) is compiled offline. In the second phase, this representation is embedded in an online configurator and utilized for fast, complete, and backtrack-free interactive product configuration. The main adv...

متن کامل

Interactive Reconfiguration in Power Supply Restoration

Given a configuration of parameters that satisfies a set of constraints, and given external changes that change and fix the value of some parameters making the configuration invalid, the problem of interactive reconfiguration is to assist a user to interactively reassign a subset of the parameters to reach a consistent configuration again. In this paper, we present two BDD-based algorithms for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0704.1394  شماره 

صفحات  -

تاریخ انتشار 2006